Transitivity of varietal hypercube networks
نویسندگان
چکیده
منابع مشابه
Approximating Transitivity in Directed Networks
We study the problem of computing a minimum equivalent digraph (also known as the problem of computing a strong transitive reduction) and its maximum objective function variant, with two types of extensions. First, we allow to declare a set D ⊂ E and require that a valid solution A satisfies D ⊂ A (it is sometimes called transitive reduction problem). In the second extension (called p-ary trans...
متن کاملTrust Transitivity in Social Networks
Non-centralized recommendation-based decision making is a central feature of several social and technological processes, such as market dynamics, peer-to-peer file-sharing and the web of trust of digital certification. We investigate the properties of trust propagation on networks, based on a simple metric of trust transitivity. We investigate analytically the percolation properties of trust tr...
متن کاملHypercube Bivariate-Based Key Management for Wireless Sensor Networks
Wireless sensor networks are composed of very small devices, called sensor nodes,for numerous applications in the environment. In adversarial environments, the securitybecomes a crucial issue in wireless sensor networks (WSNs). There are various securityservices in WSNs such as key management, authentication, and pairwise keyestablishment. Due to some limitations on sensor nodes, the previous k...
متن کاملModeling Transitivity in Complex Networks
An important source of high clustering coefficient in real-world networks is transitivity. However, existing approaches for modeling transitivity suffer from at least one of the following problems: i) they produce graphs from a specific class like bipartite graphs, ii) they do not give an analytical argument for the high clustering coefficient of the model, and iii) their clustering coefficient...
متن کاملHypercube Networks - III
1. Review of the previous lecture This section highlights the problem of routing a hard problem on the butterfly network. 2. Valiant’s Algorithm This section describes the idea behind Valiant’s algorithm for solving a hard problem on the butterfly network. 3. Ranade’s Algorithm This section briefly introduces Ranade’s algorithm. 4. Shuffle-exchange graph This section explains the properties of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers of Mathematics in China
سال: 2014
ISSN: 1673-3452,1673-3576
DOI: 10.1007/s11464-014-0427-x